Description: 关于多选择背包的很好的文章，提供了各种设计思路-Multiple Choice Knapsack Problem Example of planning choice in transportation Platform: |
Size: 390144 |
Author:amy |
Hits:
Description: Using java language implement an 0 / 1 knapsack problem. Using the recursive algorithm.And the interface also is added. Platform: |
Size: 2048 |
Author:jiangge |
Hits:
Description: 背包问题或0-1背包问题遗传算法程序，里面用的实数编码方式值得借鉴。-0-1 knapsack problem or knapsack problem genetic algorithm procedure, which uses real coding can be learned. Platform: |
Size: 2048 |
Author:olivejy |
Hits:
Description: Knapsack,用贪心算法解决背包问题，Visual C++ 6.0编译-Knapsack, with a greedy algorithm to solve knapsack problem, Visual C++ 6.0 compiler Platform: |
Size: 2257920 |
Author:草人 |
Hits:
Description: 用遗传算法解决背包问题，遗传算法的优势在于解决优化问题，对背包问题进行编码，然后随机产生使出样本，通过交叉，编译等操作来找到优化问题的解-Using genetic algorithms to solve knapsack problem, the advantage of genetic algorithms to solve optimization problem, knapsack problem is encoded, and then resorted to randomly generated sample, through the Cross, compiler and other operations to find the optimization problem Platform: |
Size: 927744 |
Author:Chen |
Hits:
Description: 将贪婪修复方法与遗传算法相结合，构成混和遗传算法，并求解经典背包问题。-The greedy repair method and genetic algorithm are combined to form hybrid genetic algorithm, and solve the classical knapsack problem. Platform: |
Size: 23552 |
Author:施金泉 |
Hits:
Description: 背包问题。。综合分析所有背包问题。。有较多例题及详解-Knapsack problem. . Comprehensive analysis of all the knapsack problem. . More examples and Xiang Jie Platform: |
Size: 121856 |
Author:卡涛 |
Hits:
Description: 混合蛙跳算法解决多背包问题，此算法是在vs2005下编写，语法为基本的c语言（可以直接复制源码到vc中运行）-Mixed leapfrog algorithm to solve multi-knapsack problem, this algorithm is prepared in vs2005, the syntax for basic c language (can copy the source code to run vc) Platform: |
Size: 11092992 |
Author:yangfei |
Hits:
Description: 這是一個使用greedy所寫的0-1 Knapsack Problem
，所有的物品若要取則必須全取，此程式可以讓背包裝最多且最有價值的物品-This is a greedy written using the 0-1 Knapsack Problem, to take all the items must all take, the program can back up and packing the most valuable items Platform: |
Size: 1024 |
Author:林文華 |
Hits:
Description: 对背包问题进行的求解，能够处理体积相同，但是不同物品的问题-The solution on the knapsack problem that can handle the same volume, but the problem of different items
Platform: |
Size: 1024 |
Author:liufeng |
Hits:
Description: C语言背包问题 Given n objects and a "knapsack." Item i weighs wi > 0 kilograms and
has value vi > 0.
◦ Knapsack has capacity of W
kilograms.
◦ Goal: fill knapsack so as to maximize total value.-C-Knapsack Problem Given n objects and a " knapsack." Item i weighs wi> 0 kilograms and has value vi> 0. ◦ Knapsack has capacity of W kilograms. ◦ Goal: fill knapsack so as to maximize total value. Platform: |
Size: 232448 |
Author:潘越 |
Hits:
Description: 详细的讲述了贪心算法和遗传算法相结合去求解NP难题，背包问题。-Greedy algorithm described in detail and the combination of genetic algorithms to solve the NP problem, knapsack problem. Platform: |
Size: 3072 |
Author:liulei |
Hits:
Search - knapsack problem